Diffusion Processes Satisfying a Conservation Law Constraint

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusion Processes Satisfying a Conservation Law Constraint

We investigate coupled stochastic differential equations governing N nonnegative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires a set of fluctuating variables to be nonnegative and (if appropriately normalized) sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of ...

متن کامل

A Ow Conservation Law for Surface Processes

The object studied in this paper is a pair ((; Y), where is a random surface in I R N and Y random vector eld on I R N. The pair is jointly stationary, i.e. its distribution is invariant under translations. The vector eld Y is smooth outside but may have discontinuities on. Gauss' divergence theorem is applied to derive a ow conservation law for Y. For I R 1 this specializes to a well-known rat...

متن کامل

Survival Distributions Satisfying Benford’s Law

Hill stated that “An interesting open problem is to determine which common distributions (or mixtures thereof) satisfy Benford’s law . . .”. This article quantifies compliance with Benford’s law for several popular survival distributions. The traditional analysis of Benford’s law considers its applicability to datasets. This article switches the emphasis to probability distributions that obey B...

متن کامل

A Compactness Result for a Pseudo-parabolic Conservation Law with Constraint

This work deals with the study of a compactness result for a class of pseudoparabolic problems of type: ∂tu− div{a(∂tu + E)∇(u + τ∂tu)} = 0. with boundary conditions that takes explicitly into account a nonlinear map of ∂tu.

متن کامل

Satisfying constraint sets through convex envelopes

In this article, we present a general representation for constraint satisfaction problems with disjunctive relations called cluster constraint systems (CCS). For this representation, we develop a novel and simple approach for solving CCSs using convex envelopes. These envelopes can be used to decompose the feasible space of the CCS through convex approximations. We explore interval reasoning as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Stochastic Analysis

سال: 2014

ISSN: 2090-3332,2090-3340

DOI: 10.1155/2014/603692